Domain Theory for Concurrency —New Categorical Foundations
نویسندگان
چکیده
منابع مشابه
Reasoning with Names and Identity in Programming Languages Previous research track record Personnel
Ian Stark has an MA and Certificate of Advanced Study in Mathematics, a Diploma and PhD in Computer Science; all from the University of Cambridge. Following his doctorate, during 1995 he held a Marie Curie Fellowship at the University of Pisa, Italy; then worked for two years at the University of Aarhus, Denmark, as a member of BRICS, the institute for Basic Research in Computer Science. Since ...
متن کاملA Theory of Recursive Domains with Applications to Concurrency ( Extended
We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on order-theoretic structures to categorytheoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf mod...
متن کاملA Theory of Recursive Domains with Applications to Concurrency ( Extended Abstract )
We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on order-theoretic structures to categorytheoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf mod...
متن کاملSome reasons for generalising domain theory
One natural way to generalize Domain Theory is to replace partially ordered sets by categories. This kind of generalization has recently found application in the study of concurrency. An outline is given of the elegant mathematical foundations which have been developed. This is specialized to give a construction of cartesian closed categories of domains, which throws light on standard presentat...
متن کاملA Theory of Recursive Domains with Applications to Concurrency
We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on ordertheoretic structures to category-theoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000